go/types.graphNode.succ (field)

8 uses

	go/types (current package)
		initorder.go#L206: 	pred, succ nodeSet    // consumers and dependencies of this node (lazily initialized)
		initorder.go#L214: 	return len(n.pred) * len(n.succ)
		initorder.go#L248: 				n.succ.add(d)
		initorder.go#L284: 				for s := range n.succ {
		initorder.go#L287: 						p.succ.add(s)
		initorder.go#L291: 				delete(p.succ, n) // remove edge to n
		initorder.go#L294: 		for s := range n.succ {
		initorder.go#L302: 		n.ndeps = len(n.succ)